Connecting the Dots: Numerical Randomized Hamiltonian Monte Carlo with State-Dependent Event Rates

نویسندگان

چکیده

Numerical generalized randomized Hamiltonian Monte Carlo is introduced, as a robust, easy to use and computationally fast alternative conventional Markov chain methods for continuous target distributions. A wide class of piecewise deterministic processes generalizing Randomized HMC (Bou-Rabee Sanz-Serna) by allowing state-dependent event rates defined. Under very mild restrictions, such will have the desired distribution an invariant distribution. Second, numerical implementation processes, based on adaptive integration second order ordinary differential equations (ODEs) considered. The yields approximate, yet highly robust algorithm that, unlike Carlo, enables exploitation complete trajectories (hence, title). proposed may yield large speedups improvements in stability relative relevant benchmarks, while incurring biases that are negligible overall errors. Granted access high-quality ODE code, methodology both implement use, even challenging high-dimensional Supplementary materials this article available online.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probability RANDOMIZED HAMILTONIAN MONTE CARLO

Tuning the duration of the Hamiltonian flow in Hamiltonian Monte Carlo (also called Hybrid Monte Carlo) (HMC) involves a tradeoff between computational and sampling efficiency, which is typically challenging to resolve in a satisfactory way. In this article we present and analyze a randomized HMC method (RHMC), in which these durations are i.i.d. exponential random variables whose mean is a fre...

متن کامل

Magnetic Hamiltonian Monte Carlo

Hamiltonian Monte Carlo (HMC) exploits Hamiltonian dynamics to construct efficient proposals for Markov chain Monte Carlo (MCMC). In this paper, we present a generalization of HMC which exploits non-canonical Hamiltonian dynamics. We refer to this algorithm as magnetic HMC, since in 3 dimensions a subset of the dynamics map onto the mechanics of a charged particle coupled to a magnetic field. W...

متن کامل

Wormhole Hamiltonian Monte Carlo

In machine learning and statistics, probabilistic inference involving multimodal distributions is quite difficult. This is especially true in high dimensional problems, where most existing algorithms cannot easily move from one mode to another. To address this issue, we propose a novel Bayesian inference approach based on Markov Chain Monte Carlo. Our method can effectively sample from multimod...

متن کامل

Split Hamiltonian Monte Carlo

We show how the Hamiltonian Monte Carlo algorithm can sometimes be speeded up by “splitting” the Hamiltonian in a way that allows much of the movement around the state space to be done at low computational cost. One context where this is possible is when the log density of the distribution of interest (the potential energy function) can be written as the log of a Gaussian density, which is a qu...

متن کامل

Monte Carlo Hamiltonian

We construct an effective Hamiltonian via Monte Carlo from a given action. This Hamiltonian describes physics in the low energy regime. We test it by computing spectrum, wave functions and thermodynamical observables (average energy and specific heat) for the free system and the harmonic oscillator. The method is shown to work also for other local potentials. PACS index: o3.65.-w, 05.10.Ln ∗Cor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Graphical Statistics

سال: 2022

ISSN: ['1061-8600', '1537-2715']

DOI: https://doi.org/10.1080/10618600.2022.2066679